Intuitionistic Modal Logics as Fragments of Classical Bimodal Logics
نویسندگان
چکیده
Godel's translation of intuitionistic formulas into modal ones provides the well-known embedding of intermediate logics into extensions of Lewis' system S4, which re ects and sometimes preserves such properties as decidability, Kripke completeness, the nite model property. In this paper we establish a similar relationship between intuitionistic modal logics and classical bimodal logics. We also obtain some general results on the nite model property of intuitionistic modal logics rst by proving them for bimodal logics and then using the preservation theorem. The aim of this paper is to show how well known results and technique developed in the eld of intermediate and classical (monoand poly-) modal logics can be used for studying various intuitionistic modal systems. The current state of knowledge in intuitionistic modal logic resembles (to some extent) that in classical modal logic about a quarter of a century ago, when the discipline was just an extensive collection of individual systems and the best method of proving decidability was the art of ltration. The reason why intuitionistic modal logic lags far behind its classical counterpart is quite apparent. Intuitionistic modal logics are much more closely related to classical bimodal logics than to usual monomodal ones, and only few recent years have brought fairly general results in polymodal logic (e.g. [9], [13], [20]). This explains also the strange fact that the embedding of intuitionistic modal logics into classical bimodal ones (via the evident generalization of G odel's translation The work of the second authorwas supportedby the Alexandervon Humboldt Foundation.
منابع مشابه
On the relation between intuitionistic and classical modal logics
Intuitionistic propositional logic Int and its extensions, known as intermediate or superintuitionistic logics, in many respects can be regarded just as fragments of classical modal logics containing S4. At the syntactical level, the Godel translation t embeds every intermediate logic L = Int+ into modal logics in the interval L = [ L = S4 t( ); L = Grz t( )]. Semantically this is re ected by ...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملPolyadic Algebras over Nonclassical Logics
The polyadic algebras that arise from the algebraization of the first-order extensions of a SIC are characterized and a representation theorem is proved. Standard implicational calculi (SIC)’s were considered by H. Rasiowa [19] and include classical and intuitionistic logic and their various weakenings and fragments, the many-valued logics of Post and Lukasiewicz, modal logics that admit the ru...
متن کاملCut Elimination for a Class of Propositional Based Logics
Sufficient conditions for propositional based logics to enjoy cut elimination are established. These conditions are satisfied by a wide class of logics encompassing among others classical and intuitionistic logic, modal logic S4, and classical and intuitionistic linear logic and some of their fragments. The class of logics is characterized by the type of rules and provisos used in their sequent...
متن کاملConnection-based Theorem Proving in Classical and Non-classical Logics
We present a uniform procedure for proof search in classical logic, intuitionistic logic, various modal logics, and fragments of linear logic. It is based on matrix characterizations of validity in these logics and extends Bibel’s connection method, originally developed for classical logic, accordingly. Besides combining a variety of different logics it can also be used to guide the development...
متن کامل